Adaptive logspace reducibility and parallel time
نویسندگان
چکیده
منابع مشابه
Logspace Reducibility: Models and Equivalences
We study the relative computational power of logspace reduction models. In particular , we study the relationships between one-way and two-way oracle tapes, resetting of the oracle head, and blanking of the oracle tape. We show that oracle models letting information persist between queries can be quite powerful, even if the information is not readable by the querying machine. We show that logsp...
متن کاملOn ~-reducibility versus Polynomial Time Many-one Reducibility*
We prove that each element of a class of f,anctions (denoted by NPCtP), whose graphs can be accepted in nondeterministic polynomial time, can be evaluated in deterministic polynomial time if and only if '/-reducibility is equivalent to polynomial time many-one reducibility. We also modify the proof technique used to obtain part of this result to obtain the stronger result that if every ,/-reduc...
متن کاملOn Truth-Table Reducibility to SAT
We show that polynomial time truth-table reducibility via Boolean circuits to SAT is the same as logspace truth-table reducibility via Boolean formulas to SAT and the same as logspace Turing reducibility to SAT. In addition, we prove that a constant number of rounds of parallel queries to SAT is equivalent to one round of parallel queries. We give an oracle relative to which ∆p2 is not equal to...
متن کاملParallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reducibility (sometimes called modular composition) is the automatic ability to break up the design of complex SFE protocols into several simpler, individually secure components. Despite much effort, only the most basic ty...
متن کاملOn Polynomial-Time Relation Reducibility
We study the notion of polynomial-time relation reducibility among computable equivalence relations. We identify some benchmark equivalence relations and show that the reducibility hierarchy has a rich structure. Specifically, we embed the partial order of all polynomial-time computable sets into the polynomial-time relation reducibility hierarchy between two benchmark equivalence relations Eλ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Systems Theory
سال: 1995
ISSN: 0025-5661,1433-0490
DOI: 10.1007/bf01191473